

<HTML>

<HEAD>

<LINK rel="stylesheet" href="../exer.css">

</HEAD>

<BODY>

<H1>

Data Structures, Algorithms, & Applications in C++<BR>

Chapter 8, Exercise 7<BR>

<BR>

</H1>

When <em class=var>m</em> is zero, the binary tree must be empty.

There is no limit on the number of nodes so long as <em class=var>m</em>

&gt;= 1.  For example, a left skewed binary tree with height

<em class=var>h</em> &gt;= 1 has <em class=var>h</em> nodes and only one

leaf.



</FONT>

</BODY>

</HTML>

